Reordering buffer management with advice
نویسندگان
چکیده
منابع مشابه
Reordering Buffer Management with Advice
In the reordering buffer management problem, a sequence of colored items arrives at a service station to be processed. Each color change between two consecutively processed items generates some cost. A reordering buffer of capacity k items can be used to preprocess the input sequence in order to decrease the number of color changes. The goal is to find a scheduling strategy that, using the reor...
متن کاملGeneralized Reordering Buffer Management
An instance of the generalized reordering buffer management problem consists of a service station that has k servers, each configured with a color, and a buffer of size b. The station needs to serve an online stream of colored items. Whenever an item arrives, it is stored in the buffer. At any point in time, a currently pending item can be served by switching a server to its color. The objectiv...
متن کاملNew Approximations for Reordering Buffer Management
In this paper we consider the buffer reordering management problem. In this model there are n elements that arrive over time with different colors. There is a buffer that can store up to k elements and when the buffer becomes full an element must be output. If an element is output that has a color different from the previous element, a cost depending on the color must be paid. This cost could b...
متن کاملOn the Advice Complexity of Buffer Management
We study the advice complexity of online buffer management. Advice complexity measures the amount of information about the future that an online algorithm needs to achieve optimality or a good competitive ratio. We study the 2-valued buffer management problem in both preemptive and nonpreemptive models and prove lower and upper bounds on the number of bits required by an optimal online algorith...
متن کاملAn optimal randomized online algorithm for reordering buffer management
We give an O(log log k)-competitive randomized online algorithm for reordering buffer management, where k is the buffer size. Our bound matches the lower bound of Adamaszek et al. (STOC 2011). Our algorithm has two stages which are executed online in parallel. The first stage computes deterministically a feasible fractional solution to an LP relaxation for reordering buffer management. The seco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2016
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-016-0487-8